منابع مشابه
Discretization of Continuous Attributes
In the data-mining field, many learning methods — such as association rules, Bayesian networks, and induction rules (Grzymala-Busse & Stefanowski, 2001) — can handle only discrete attributes. Therefore, before the machine-learning process, it is necessary to re-encode each continuous attribute in a discrete attribute constituted by a set of intervals. For example, the age attribute can be trans...
متن کاملDynamic Discretization of Continuous Attributes
Discretization of continuous attributes is an important task for certain types of machine learning algorithms. Bayesian approaches, for instance, require assumptions about data distributions. Decision Trees, on the other hand, require sorting operations to deal with continuous attributes , which largely increase learning times. This paper presents a new method of discretization, whose main char...
متن کاملFrame Semantics of Continuous Processes
Qualitative Process theory provides a formal representation for human-like models of continuous processes. However, qualitative reasoning systems frequently rely on hand-made models which inhibits expansion into new domains. A representation that unifies QP theory with natural language expressions would allow these systems to expand their models by reading and interaction, thus greatly increasi...
متن کاملDiscretization of Continuous Time-delay Systems
Many works are related to the analysis and control of either continuous or else discrete time-delay systems. However, the discretization of continuous timedelay systems has not been extensively studied. In this work, sampled-data time-delay systems with internal and external point delays are described by approximate discrete time-delay systems in the discrete domain. Those approximate discrete ...
متن کاملOn Exploring Soft Discretization of Continuous Attributes
Searching for a binary partition of attribute domains is an important task in data mining. It is present in both decision tree construction and discretization. The most important advantages of decision tree methods are compactness and clearness of knowledge representation as well as high accuracy of classification. Decision tree algorithms also have some drawbacks. In cases of large data tables...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings - Mathematical Sciences
سال: 2012
ISSN: 0253-4142,0973-7685
DOI: 10.1007/s12044-012-0075-6